Boolean Games with Epistemic Goals
نویسندگان
چکیده
We introduce and formally study games in which the goals of players relate to the epistemic states of players in the game. For example, one player might have a goal that another player knows a certain proposition, while another player might have as a goal that a certain player does not know some proposition. The formal model we use to study epistemic games is a variation of the increasingly popular Boolean games model in which each player controls a number of Boolean variables, but has limited ability to see the truth values of the overall set of formulae that hold in the game. Each player in an epistemic Boolean game has a goal, defined as a formula of modal epistemic logic. Using such a language for goals allows us to explicitly and compactly represent desirable epistemic states. After motivating and formally defining epistemic Boolean games as a concise representation of epistemic Kripke structures, we investigate their complexity and study their properties.
منابع مشابه
Epistemic Boolean Games Based on a Logic of Visibility and Control
We analyse epistemic boolean games in a computationally grounded dynamic epistemic logic. The agents’ knowledge is determined by what they see, including higher-order visibility: agents may observe whether another agent observes an atom or not. The agents’ actions consist in modifying the truth values of atoms. We provide an axiomatisation of the logic, establish that the model checking problem...
متن کاملSynthesizing Strategies for Epistemic Goals by Epistemic Model Checking: An Application to Pursuit Evasion Games
The paper identifies a special case in which the complex problem of synthesis from specifications in temporal-epistemic logic can be reduced to the simpler problem of model checking such specifications. An application is given of strategy synthesis in pursuit-evasion games, where one or more pursuers with incomplete information aim to discover the existence of an evader. Experimental results ar...
متن کاملDecentralized Computation of Pareto Optimal Pure Nash Equilibria of Boolean Games with Privacy Concerns
In Boolean games, agents try to reach a goal formulated as a Boolean formula. These games are attractive because of their compact representations. However, few methods are available to compute the solutions and they are either limited or do not take privacy or communication concerns into account. In this paper we propose the use of an algorithm related to reinforcement learning to address this ...
متن کاملŁukasiewicz Games
Boolean games provide a simple, compact, and theoretically attractive abstract model for studying multi-agent interactions in settings where players will act strategically in an attempt to achieve personal goals. A standard critique of Boolean games, however, is that the binary nature of goals (satisfied or unsatisfied) inevitably trivialises the nature of such strategic interactions: a player ...
متن کاملDependency in Cooperative Boolean Games
Cooperative boolean games are coalitional games with both goals and costs associated to actions, and dependence networks for boolean games are a kind of social networks representing how the actions of other agents have an influence on the achievement of an agent’s goal. In this paper, we introduce two new types of dependence networks, called the abstract dependence network and the refined depen...
متن کامل